Communication-efficient distributed mining of association rules
نویسندگان
چکیده
منابع مشابه
Efficient Mining of Association Rules in Distributed Databases
Many sequential algorithms have been proposed for mining of association rules. However, very little work has been done in mining association rules in distributed databases. A direct application of sequential algorithms to distributed databases is not eeective, because it requires a large amount of communication overhead. In this study, an eecient algorithm, DMA, is proposed. It generates a smal...
متن کاملTitle Efficient Mining of Association Rules in Distributed Databases Rights Creative Commons: Attribution 3.0 Hong Kong License Efficient Mining of Association Rules in Distributed Databases
Many sequential algorithms have been proposed for mining of association rules. However, very little work has been done in mining association rules in distributed databases. A direct application of sequential algorithms to distributed databases is not effective, because it requires a large amount of communication overhead. In this study, an efficient algorithm, DMA, is proposed. It generates a s...
متن کاملEfficient Mining of Intertransaction Association Rules
Most of the previous studies on mining association rules are on mining intratransaction associations, i.e., the associations among items within the same transaction where the notion of the transaction could be the items bought by the same customer, the events happened on the same day, etc. In this study, we break the barrier of transactions and extend the scope of mining association rules from ...
متن کاملAutomated Support Specification for Efficient Mining of Interesting Association Rules Automated Support Specification for Efficient Mining of Interesting Association Rules
In recent years, the weakness of the canonical support-confidence framework for associations mining has been widely studied. One of the difficulties in applying association rules mining is the setting of support constraints. A high-support constraint avoids the combinatorial explosion in discovering frequent itemsets, but at the expense of missing interesting patterns of low support. Instead of...
متن کاملPrivacy-Preserving Mining of Association Rules on Distributed Databases
Data mining techniques can extract hidden but useful information from large databases. Most efficient approaches for mining distributed databases suppose that all of the data at each site can be shared. However, source transaction databases usually include very sensitive information. In order to obtain an accurate mining result on distributed databases and to preserve the private data that is a...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: ACM SIGMOD Record
سال: 2001
ISSN: 0163-5808
DOI: 10.1145/376284.375728